On Legendre symbol lattices
نویسندگان
چکیده
The pseudorandom properties of a two dimensional “binary plattice” related to the Legendre symbol are studied.
منابع مشابه
On Some Determinants with Legendre Symbol Entries
Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 210093, People’s Republic of China [email protected] http://math.nju.edu.cn/∼zwsun Abstract. In this paper we mainly focus on some determinants with Legendre symbol entries. For an odd prime p and an integer d, let S(d, p) denote the determinant of the (p − 1)/2 × (p − 1)/2 matrix whose (i, j)-entry (1 6 i, j 6 (p− 1)/2) is the Le...
متن کاملDerandomizing restricted isometries via the Legendre symbol
Abstract. The restricted isometry property (RIP) is an important matrix condition in compressed sensing, but the best matrix constructions to date use randomness. This paper leverages pseudorandom properties of the Legendre symbol to reduce the number of random bits in an RIP matrix with Bernoulli entries. In this regard, the Legendre symbol is not special—our main result naturally generalizes ...
متن کاملOn the complexity of a family related to the Legendre symbol
Ahlswede, Khachatrian, Mauduit and A. Sárközy introduced the notion family-complexity of families of binary sequences. They estimated the family-complexity of a large family related to Legendre symbol introduced by Goubin, Mauduit and Sárközy. Here their result is improved, and apart from the constant factor the best lower bound is given for the family-complexity. 2000 AMS Mathematics Subject C...
متن کاملEvaluation of Certain Legendre Symbols
We state and prove an apparently hitherto unrecorded evaluation of certain Legendre symbols: if p is prime, p 6= 2, and ab = p − 1, then the Legendre symbol ( b p ) is given by ( b p ) = (−1).
متن کاملEfficient Quantum Algorithms for Shifted Quadratic Character Problems
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear to fit into the framework of the Hidden Subgroup Problem. The classical complexity of the problem is unknown, despite the various results on the irregularity ...
متن کامل